(1 + u)-Constacyclic codes over Z4 + uZ4
نویسندگان
چکیده
Constacyclic codes are an important class of linear codes in coding theory. Many optimal linear codes are directly derived from constacyclic codes. In this paper, (1 + u)-constacyclic codes over Z 4 + uZ 4 of any length are studied. A new Gray map between Z 4 + uZ 4 and Z 4 (4) is defined. By means of this map, it is shown that the Z 4 Gray image of a (1 + u)-constacyclic code of length n over Z 4 + uZ 4 is a cyclic code over Z 4 of length 4n. Furthermore, by combining the classical Gray map between Z 4 and F 2 (2), it is shown that the binary image of a (1 + u)-constacyclic code of length n over Z 4 + uZ 4 is a distance invariant binary quasi-cyclic code of index 4 and length 8n. Examples of good binary codes are constructed to illustrate the application of this class of codes.
منابع مشابه
On constacyclic codes over Z4[u]/〈u2-1〉 and their Gray images
We first define a new Gray map from R = Z4+uZ4 to Z 2 4, where u 2 = 1 and study (1 + 2u)-constacyclic codes over R. Also of interest are some properties of (1 + 2u)constacyclic codes over R. Considering their Z4 images, we prove that the Gray images of (1+2u)-constacyclic codes of length n over R are cyclic codes of length 2n over Z4. In many cases the latter codes have better parameters than ...
متن کاملIsometries and Binary Images of Linear Block Codes over Z4+uZ4 and Z8+uZ8
Let F2 be the binary field and Z2r the residue class ring of integers modulo 2 , where r is a positive integer. For the finite 16-element commutative local Frobenius nonchain ring Z4 + uZ4, where u is nilpotent of index 2, two weight functions are considered, namely the Lee weight and the homogeneous weight. With the appropriate application of these weights, isometric maps from Z4 + uZ4 to the ...
متن کاملCyclic codes over $\mathbb{Z}_4[u]/\langle u^k\rangle$ of odd length
Let R = Z4[u]/〈u〉 = Z4 + uZ4 + . . . + uZ4 (u = 0) where k ∈ Z satisfies k ≥ 2. For any odd positive integer n, it is known that cyclic codes over R of length n are identified with ideals of the ring R[x]/〈x − 1〉. In this paper, an explicit representation for each cyclic code over R of length n is provided and a formula to count the number of codewords in each code is given. Then a formula to c...
متن کامل$\mathbb{Z}_{q}(\mathbb{Z}_{q}+u\mathbb{Z}_{q})$-Linear Skew Constacyclic Codes
In this paper, we study skew constacyclic codes over the ring ZqR where R = Zq + uZq, q = p s for a prime p and u2 = 0. We give the definition of these codes as subsets of the ring ZqR . Some structural properties of the skew polynomial ring R[x, θ] are discussed, where θ is an automorphism of R. We describe the generator polynomials of skew constacyclic codes over R and ZqR. Using Gray images ...
متن کاملOn cyclic DNA codes over the Ring $\Z_4 + u \Z_4$
In this paper, we study the theory for constructing DNA cyclic codes of odd length over Z4[u]/〈u 2〉 which play an important role in DNA computing. Cyclic codes of odd length over Z4+uZ4 satisfy the reverse constraint and the reverse-complement constraint are studied in this paper. The structure and existence of such codes are also studied. The paper concludes with some DNA example obtained via ...
متن کامل